Timewise refinement for communicating processes
نویسندگان
چکیده
منابع مشابه
Timewise Refinement for Communicating Processes
A theory of timewise reenement is presented. This allows the translation of speciications and proofs of correctness between semantic models, permitting each stage in the veriication of a system to take place at the appropriate level of abstraction. The theory is presented within the context of CSP. A denotational characterisation of reenement is given in terms of relations between behaviours at...
متن کاملTimewise Re nement for Communicating Processes
A theory of timewise re nement is presented This allows the translation of speci cations and proofs of correctness between semantic models permitting each stage in the veri cation of a system to take place at the appropriate level of abstraction The theory is presented within the context of CSP A denotational characterisation of re nement is given in terms of relations between behaviours at di ...
متن کاملA Refinement of Communicating Processes
The programming of MIMD multiprocessors requires to design processes to be mapped on the nodes of the architecture and communicating by message passing. The aim of this paper is to give a contribution for a rationalized design of such programs from formal speciications. We introduce a reenement calculus of parallel speciications in which processes reene the safety properties and communications ...
متن کاملFailure-Divergence Refinement of Compensating Communicating Processes
Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provi...
متن کاملThe automated verification of timewise refinement (Draft)
While Hoare’s CSP models reactive systems without assigning an exact time to events, Timed CSP records the exact times as nonnegative reals. Timed CSP therefore provides a more exact semantics of systems, but it still makes sense to ask whether a timed process satisfies an untimed specification. Indeed the question of whether such specifications are satisfied often reduces to the timing details...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1997
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(96)00016-0